package LeetCode;

import com.sun.corba.se.impl.resolver.SplitLocalResolverImpl;
import com.sun.org.apache.xml.internal.serializer.OutputPropertyUtils;

import java.util.Arrays;

public class Practice_01 {
    public static void main(String[] args) {
        System.out.println(Arrays.toString(printNumbers(1)));
    }
    public static int[] printNumbers(int n) {
        int a=(int)Math.pow(10, n) - 1;
        System.out.println(a);
        int[] result=new int[a];
        for(int i=0;i<a;i++){
            result[i]=i+1;
        }
        return result;
    }

}
